Algorithm 13. Approximate function expansion into a Chebyshev series
نویسندگان
چکیده
منابع مشابه
Chebyshev Series Expansion of Inverse Polynomials
if the polynomial has no roots in [−1, 1]. If the inverse polynomial is decomposed into partial fractions, the an are linear combinations of simple functions of the polynomial roots. If the first k of the coefficients an are known, the others become linear combinations of these with expansion coefficients derived recursively from the bj ’s. On a closely related theme, finding a polynomial with ...
متن کاملDynamic Programming for Approximate Expansion Algorithm
Expansion algorithm is a popular optimization method for labeling problems. For many common energies, each expansion step can be optimally solved with a min-cut/max flow algorithm. While the observed performance of max-flow for the expansion algorithm is fast, its theoretical time complexity is worse than linear in the number of pixels. Recently, Dynamic Programming (DP) was shown to be useful ...
متن کاملAsymptotic upper bounds for the coefficients in the Chebyshev series expansion for a general order integral of a function
The usual way to determine the asymptotic behavior of the Chebyshev coefficients for a function is to apply the method of steepest descent to the integral representation of the coefficients. However, the procedure is usually laborious. We prove an asymptotic upper bound on the Chebyshev coefficients for the kth integral of a function. The tightness of this upper bound is then analyzed for the c...
متن کاملDetermination of a jump by Fourier and Fourier-Chebyshev series
By observing the equivalence of assertions on determining the jump of a function by its differentiated or integrated Fourier series, we generalize a previous result of Kvernadze, Hagstrom and Shapiro to the whole class of functions of harmonic bounded variation. This is achieved without the finiteness assumption on the number of discontinuities. Two results on determination of ...
متن کاملA HOMOTOPY PERTURBATION ALGORITHM AND TAYLOR SERIES EXPANSION METHOD TO SOLVE A SYSTEM OF SECOND KIND FREDHOLM INTEGRAL EQUATIONS
In this paper, we will compare a Homotopy perturbation algorithm and Taylor series expansin method for a system of second kind Fredholm integral equations. An application of He’s homotopy perturbation method is applied to solve the system of Fredholm integral equations. Taylor series expansin method reduce the system of integral equations to a linear system of ordinary differential equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1971
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-12-2-227-237